package 力扣;

import java.util.HashMap;

public class leetcode1 {
    public int[] twoSum(int[] nums, int target) {
        for (int i = 0; i < nums.length; i++) {
            for (int j=i+1;j<nums.length;j++){
                if(nums[i]>=target) break;
                if((nums[i]+nums[j])==target) return new int[]{i,j};
            }
        }
        return null;
    }
}
